Weak disjointness of measure preserving dynamical systems

نویسنده

  • Emmanuel Lesigne
چکیده

Two measure preserving dynamical systems are weakly disjoint if some pointwise convergence property is satisfied by ergodic averages on their direct product (a precise definition is given below). Disjointness implies weak disjointness. We start studying this new concept, both by stating some general properties and by giving various examples. The content of the article is summarized in the introduction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entropy Theory without Past

This paper treats the Pinsker algebra of a dynamical system in a way which avoids the use of an ordering on the acting group. This enables us to prove some of the classical results about entropy and the Pinsker algebra in the general setup of measure preserving dynamical systems, where the acting group is a discrete countable amenable group. We prove a basic disjointness theorem which asserts t...

متن کامل

On Ergodic Type Theorems for Strictly Weak Mixing C∗-dynamical Systems

It is known (see [16]) that there are several notions of mixing (i.e. weak mixing, mixing, completely mixing e.c.t.) of measure preserving transformation on a measure space in the ergodic theory. It is important to know how these notions are related with each other. A lot of papers are devoted to this topic. In [1] a rather thorough study of the mentioned concepts of mixing for Markov operators...

متن کامل

Entropy of infinite systems and transformations

The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...

متن کامل

ENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH

Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...

متن کامل

The Measure of Non-compactness of a Disjointness Preserving Operator

Let E and F be Banach lattices and assume E∗ has no atoms. Let T : E → F be a norm bounded disjointness preserving operator from E into F . Then β(T ) = α(T ) = ‖T‖e = ‖T‖.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017